On Security of Hill Cipher using Finite Fields
نویسندگان
چکیده
Hill cipher in cryptography is a symmetric key substitution algorithm, which is vulnerable to known plaintext attack. The present paper provides two fold securities to the existing Hill cipher by using the elements of finite fields and logical operator.
منابع مشابه
New Fixed Point Attacks on GOST2 Block Cipher
GOST block cipher designed in the 1970s and published in 1989 as the Soviet and Russian standard GOST 28147-89. In order to enhance the security of GOST block cipher after proposing various attacks on it, designers published a modified version of GOST, namely GOST2, in 2015 which has a new key schedule and explicit choice for S-boxes. In this paper, by using three exactly identical portions of ...
متن کاملAnalysis of Modified Substitution Encryption Techniques
-In this paper we present some new approach for security enhancement of well known classical substitution cipher (Playfair and Hill cipher). Some drawback inherent the 5x5 Playfair cipher which adversely affect the security of this cipher and also Hill Cipher that succumbs to the known-plaintext attack .It is clear from above line due to some serious security reasons we cannot use these well kn...
متن کاملCipher text only attack on speech time scrambling systems using correction of audio spectrogram
Recently permutation multimedia ciphers were broken in a chosen-plaintext scenario. That attack models a very resourceful adversary which may not always be the case. To show insecurity of these ciphers, we present a cipher-text only attack on speech permutation ciphers. We show inherent redundancies of speech can pave the path for a successful cipher-text only attack. To that end, regularities ...
متن کاملOn the Keyspace of the Hill Cipher
ABSTRACT: In its most general form, the Hill cipher’s keyspace consists of all matrices of a given dimension that are invertible over Zm. Working from known results over finite fields, we assemble and prove a formula for the number of such matrices. We also compare this result with the total number of matrices and the number of involutory matrices for a given dimension and modulus, identifying ...
متن کاملTotal break of Zorro using linear and differential attacks
An AES-like lightweight block cipher, namely Zorro, was proposed in CHES 2013. While it has a 16-byte state, it uses only 4 S-Boxes per round. This weak nonlinearity was widely criticized, insofar as it has been directly exploited in all the attacks on Zorro reported by now, including the weak key, reduced round, and even full round attacks. In this paper, using some properties discovered by Wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013